Towards an Accurate Mathematical Model of Generic Nominally-Typed OOP
نویسنده
چکیده
The construction of GNOOP as a domain-theoretic model of generic nominally-typed OOP is currently underway. This extended abstract presents the concepts of ‘nominal intervals’ and ‘full generification’ that are likely to help in building GNOOP as an accurate mathematical model of generic nominally-typed OOP. The abstract also presents few related category-theoretic suggestions. The presented concepts and suggestions are particularly geared towards enabling GNOOP to offer a precise and simple view of so-far-hard-to-analyze features of generic OOP such as variance annotations (e.g., Java wildcard types) and erased generics (e.g., Java type erasure).
منابع مشابه
Novel Uses of Category Theory in Modeling OOP
Category theory has been used extensively and successfully in modeling functional programming languages (see, e.g., [22, 23, 17, 20, 25, 15]). However, it has been used to a lesser extent in understanding and modeling object-oriented programming (OOP) languages, mainly focusing on OO languages extant during the early days of OOP research [13, 16, 18, 21]. Recently, we presented a detailed outli...
متن کاملAn Overview of Nominal-Typing versus Structural-Typing in Object-Oriented Programming
NOOP [4, 6, 7, 8] is a mathematical model of nominally-typed OOP that proves the identification of inheritance and subtyping in mainstream nominally-typed OO programming languages and the validity of this identification [11]. This report gives an overview of the main notions in OOP relevant to constructing a mathematical model of OOP such as NOOP. The emphasis in this report is on defining nomi...
متن کاملA Comparison of NOOP to Structural Domain-Theoretic Models of Object-Oriented Programming
Mainstream object-oriented programming (OOP) languages such as Java, C#, C++ and Scala are all almost entirely nominally-typed. NOOP is a recently developed domain-theoretic model of OOP that was designed to fully include nominal information found in nominally-typed OOP. This paper compares NOOP to the most widely known domain-theoretic models of OOP, namely, the models developed by Cardelli an...
متن کاملNOOP: A Domain-Theoretic Model of Nominally-Typed OOP
The majority of industrial-strength object-oriented (OO) software is written using nominally-typed OO programming languages. Extant domain-theoretic models of OOP developed to analyze OO type systems miss, however, a crucial feature of these mainstream OO languages: nominality. This paper presents the construction of NOOP as the first domain-theoretic model of OOP that includes full class/type ...
متن کاملDomain Theory for Modeling OOP: A Summary (Domain Theory for The Construction of NOOP, and The Construction of COOP as a Step Towards Constructing NOOP)
Domain theory is ‘a mathematical theory that serves as a foundation for the semantics of programming languages’ [AJ94]. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of “degrees of definedness”, so as to model incremental higher-order computation (i.e., computing with infinite data values, such as f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.05114 شماره
صفحات -
تاریخ انتشار 2016